Strong Approximations for Time-Dependent Queues

نویسندگان

  • Avishai Mandelbaum
  • William A. Massey
چکیده

A time-dependent Mt/Mt/1 queue alternates through periods of under-, over-, and critical loading. We derive period-dependent, pathwise asymptotic expansions for its queue length, within the framework of strong approximations. Our main results include time-dependent fluid approximations, supported by a functional strong law of large numbers, and diffusion approximations, supported by a functional central limit theorem. This complements and extends previous work on asymptotic expansions of the queue-length transition probabilities.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Error in Steady-State Approximations for the Time-Dependent Waiting Time Distribution

Arrival processes to queues often exhibit time dependence, but time-dependent queues are notoriously difficult to analyze. Usually one adopts some kind of steadystate approximation for time-dependent performance. We consider a range of queueing models that see wide use in practice, particularly in the modeling of service industry applications, and develop approximations for the error involved i...

متن کامل

Fluid Models for Multiserver Queues with Abandonments

Deterministic fluid models are developed to provide simple first-order performance descriptions for multi-server queues with abandonment under heavy loads. Motivated by telephone call centers, the focus is on multi-server queues with a large number of servers and non-exponential service-time and time-to-abandon distributions. The first fluid model serves as an approximation for the G/GI/s + GI ...

متن کامل

Critically Loaded Time-Varying Multiserver Queues: Computational Challenges and Approximations

In this paper, we consider time-varying multi-server queues with abandonment and retrials. For their performance analysis, fluid and diffusion limits utilizing strong approximations have been widely used in the literature. Although those limits are asymptotically exact, they may not accurately approximate performance of multi-server queues even if the number of servers is large. To address that...

متن کامل

Diffusion Models and Steady-state Approximations for Exponentially Ergodic Markovian Queues by Itai Gurvich

Motivated by queues with many-servers, we study Brownian steady-state approximations for continuous time Markov chains (CTMCs). Our approximations are based on diffusion models (rather than a diffusion limit) whose steady-state, we prove, approximates well that of the Markov chain. Strong approximations provide such “limitless” approximations for process dynamics. Our focus here is on steady-st...

متن کامل

Exponential Approximations for Tail Probabilities in Queues: Sojourn Time and Workload

In this paper, we focus on simple exponential approximations for steady-state tail probabilities in G/GI/1 queues based on large-time asymptotics. We relate the large-time asymptotics for the steady-state waiting time, sojourn time and workload. We evaluate the exponential approximations based on the exact asymptotic parameters and their approximations by making comparisons with exact numerical...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Oper. Res.

دوره 20  شماره 

صفحات  -

تاریخ انتشار 1995